A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem

نویسندگان

چکیده

Abstract In this paper, we suggest a new infeasible interior-point method (IIPM) for $$P_{*}(\kappa )$$ P ∗ ( κ ) -linear complementarity problem ( -LCP) based on class of kernel functions with full-Newton steps. Each iteration the algorithm consists feasible step and few centering The is defined by newly proposed functions, while determined using Newton’s method. New includes logarithmic function in Roos (SIAM J Optim 16:1110–1136, 2006) trigonometric Moslemi Kheirfam (Optim Lett 13:127–157, 2019), Haghighi (Commun Comb 3:51–70, 2018), Fathi-Hafshejani et al. (J Appl Math Comput 48:111–128, 2015) as special cases. And show that has best known complexity $$P_*(\kappa -LCP such present some numerical results.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

a full nesterov-todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

متن کامل

A a Full - Newton Step Infeasible - Interior - Point Algorithm for P ∗ ( Κ ) - Horizontal Linear Complementarity Problems

In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is produced by suitable perturbation in HLCP problem. Then, we use so-called feasibility steps that serves to generate strictly feasible iterates for the ...

متن کامل

A Full Nesterov-todd Step Infeasible Interior-point Algorithm for Symmetric Cone Linear Complementarity Problem

A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasibility steps, finds...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2023

ISSN: ['1862-4480', '1862-4472']

DOI: https://doi.org/10.1007/s11590-023-02025-5